Range minimum queries in minimal space

We consider the problem of computing a sequence range minimum queries. assume commands that contains values and Our goal is to quickly determine value exists between current position previous i . Range queries are used as sub-routine several algorithms, namely related string processing. propose data structure can process these command sequences. obtain efficient results for variations problem, in particular we O ( 1 ) time per offline version α n amortized online version, where inverse Ackermann function number sequence. This also has very small space requirements, ℓ maximum active positions. implemented our show it competitive against existing alternatives. comparable processing time, nanosecond range, much smaller requirements.